Lower Bounds for non-Boolean Constraint Satisfaction Programs
نویسنده
چکیده
We use a recent recycling construction of Samorodnitsky and Trevisan combined with the techniques of H̊astad to show that the kCSP problem over an Abelian group G cannot be approximated within |G|k−O( √ k) − , for any constant > 0, unless P = NP. This lower bound matches well with the best known upper bound, |G|k−1, of Serna, Trevisan and Xhafa.
منابع مشابه
Second moment method for a family of boolean CSP
The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first moment method on the number of solutions permits to compute upper bounds on any boolean CSP, the second moment method used for computing lower bounds proves to be more tricky and in most cases gives only the trivial ...
متن کاملThe Non-approximability of Non-Boolean Predicates
Abstract. Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactive proof systems with harmonic analysis over finite groups, Håstad showed that for sever...
متن کاملSolving partial constraint satisfaction problems with tree decomposition
In this paper, we describe a computational study to solve hard partial constraint satisfaction problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a diversity of problems, such as generalized subgraph problems, MAX-SAT, Boolean quadratic programs, and assignment problems like coloring and frequency planning. We present a dynamic programming algorithm that solve...
متن کاملFixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory, and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries, and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems a...
متن کاملLower bounds on the size of semide nite programming relaxations
We introduce amethod for proving lower bounds on the e cacy of semide nite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on n-vertex graphs are not the linear image of the feasible region of any SDP (i.e., any spectrahedron) of dimension less than 2nδ , for some constant δ > 0. This result yields the rst super-polyno...
متن کامل